Graph-like compacta: Characterizations and Eulerian loops

A compact graph-like space is a triple $\left(X,V,E\right)$, where $X$ is a compact, metrizable space, $V\subseteq X$ is a closed zero-dimensional subset, and $E$ is an index set such that $X⧹V\cong \text{◂+▸}E\times \left(0,1\right)$. New characterizations of compact graph-like spaces are given, connecting them to certain classes of continua, and to standard subspaces of Freudenthal compactifications of locally finite graphs. These are applied to characterize Eulerian graph-like compacta.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.     

Strong cliques in vertex-transitive graphs

A clique (resp, independent set) in a graph is strong if it intersects every maximal independent set (resp, every maximal clique). A graph is clique intersect stable set (CIS) if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques. In this paper we prove that a clique $C$ in a vertex-transitive graph $\mathrm{\Gamma }$ is strong if and only if $\text{◂=▸}\text{◂⋅▸}\mid C\mid \mid I\mid =\mid V\left(\mathrm{\Gamma }\right)\mid$ for every maximal independent set $I$ of $\mathrm{\Gamma }$. On the basis of this result we prove that a vertex-transitive graph is CIS if and only if it admits a strong clique and a strong independent set. We classify all vertex-transitive graphs of valency at most 4 admitting a strong clique, and give a partial characterization of 5-valent vertex-transitive graphs admitting a strong clique. Our results imply that every vertex-transitive graph of valency at most 5 that admits a strong clique is localizable. We answer an open question by providing an example of a vertex-transitive CIS graph which is not localizable.     

Topological bulk-edge effects in quantum graph transport

We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim with two examples. In the first, the transport is possible at high energies in the bulk only being suppressed at the sample edges, while in the second one the situation is opposite, the transport is possible at the edge only.     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.     

There is no (95, 40, 12, 20) strongly regular graph

We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.     

On the equational graphs over finite fields

In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y)=0$ with variables X and Y over a finite field ${\mathbb{F}}_q$ of odd characteristic, we define a digraph by choosing the elements in ${\mathbb{F}}_q$ as vertices and drawing an edge from x to y if and only if $E(x,y)=0$. We call this graph as equational graph. In this paper, we study the equational graph when choosing $E(X,Y)=(Y^2-f(X))(\lambda Y^2-f(X))$ with $f(X)$ a polynomial over ${\mathbb{F}}_q$ and λ a non-square element in ${\mathbb{F}}_q$. We show that if f is a permutation polynomial over ${\mathbb{F}}_q$, then every connected component of the graph has a Hamiltonian cycle. Moreover, these Hamiltonian cycles can be used to construct balancing binary sequences. By making computations for permutation polynomials f of low degree, it appears that almost all these graphs are strongly connected, and there are many Hamiltonian cycles in such a graph if it is connected.     

Neural network representations of quantum many-body states

Machine learning is currently the most active interdisciplinary field having numerous applications;additionally,machine-learning techniques are used to research quantum many-body problems.In this study,we first propose neural network quantum states(NNQSs)with general input observables and explore a few related properties,such as the tensor product and local unitary operation.Second,we determine the necessary and sufficient conditions for the representability of a general graph state using normalized NNQS.Finally,to quantify the approximation degree of a given pure state,we define the best approximation degree using normalized NNQSs.Furthermore,we observe that some 7V-qubit states can be represented by a normalized NNQS,such as separable pure states,Bell states and GHZ states.